2 ND INTERNATIONAL CONFERENCE ON METAHEURISTICS - MIC 97 1 Guided Local Search for the Vehicle Routing

2 ND INTERNATIONAL CONFERENCE ON METAHEURISTICS - MIC 97 1 Combination of oscillating local search and heuristicallyordered implicit

2 ND INTERNATIONAL CONFERENCE ON METAHEURISTICS - MIC 97 1 Meta - heuristics in Constraint ProgrammingExperiments

2 Nd International Conference on Metaheuristics - Mic 97 32

In this paper we present an extension of MAX{MIN Ant System applying it to Traveling Salesman Problems and Quadratic Assignment Problems. The extension involves the use of a modiied choice rule and a hybrid scheme allowing ants to improve their solution by local search. The computational results show that this algorithm can be used to eeciently nd near optimal solutions to hard combinatorial op...

A HYBRID ALGORITHM FOR THE OPEN VEHICLE ROUTING PROBLEM

The open vehicle routing problem (OVRP) is a variance of the vehicle routing problem (VRP) that has a unique character which is its open path form. This means that the vehicles are not required to return to the depot after completing service. Because this problem belongs to the NP-hard problems, many metaheuristic approaches like the ant colony optimization (ACO) have been used to solve OVRP in...

2 ND INTERNATIONAL CONFERENCE ON METAHEURISTICS - MIC 97 1 Procedure for ranking heuristics applied to graph partitioningGeorg